A topology-based approach to computing neighborhood-of-interest points using the Morse complex
نویسندگان
چکیده
a Informatics Department, Federal University of Technology, Curitiba, PR 80230-901, Brazil Department of Computer Science, Universidade Federal de Minas Gerais, Belo Horizonte, MG 31270-010, Brazil c Institute of Computing, University of Campinas, Campinas, SP 13083-852, Brazil d Institute for Data Analysis and Visualization, Department of Computer Science, University of California, Davis, CA 95616-8562, USA
منابع مشابه
A Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملEFFICIENT SIMULATION FOR OPTIMIZATION OF TOPOLOGY, SHAPE AND SIZE OF MODULAR TRUSS STRUCTURES
The prevalent strategy in the topology optimization phase is to select a subset of members existing in an excessively connected truss, called Ground Structure, such that the overall weight or cost is minimized. Although finding a good topology significantly reduces the overall cost, excessive growth of the size of topology space combined with existence of varied types of design variables challe...
متن کاملStatistical Topology Using the Nonparametric Density Estimation and Bootstrap Algorithm
This paper presents approximate confidence intervals for each function of parameters in a Banach space based on a bootstrap algorithm. We apply kernel density approach to estimate the persistence landscape. In addition, we evaluate the quality distribution function estimator of random variables using integrated mean square error (IMSE). The results of simulation studies show a significant impro...
متن کاملTOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS
This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...
متن کاملON FUZZY NEIGHBORHOOD BASED CLUSTERING ALGORITHM WITH LOW COMPLEXITY
The main purpose of this paper is to achieve improvement in thespeed of Fuzzy Joint Points (FJP) algorithm. Since FJP approach is a basisfor fuzzy neighborhood based clustering algorithms such as Noise-Robust FJP(NRFJP) and Fuzzy Neighborhood DBSCAN (FN-DBSCAN), improving FJPalgorithm would an important achievement in terms of these FJP-based meth-ods. Although FJP has many advantages such as r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Visual Communication and Image Representation
دوره 30 شماره
صفحات -
تاریخ انتشار 2015